Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
نویسندگان
چکیده
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
منابع مشابه
Acyclic Colorings and Triangulations of Weakly Chordal Graphs
An acyclic coloring of a graph is a proper vertex coloring without bichromatic cycles. We show that the acyclic colorings of any weakly chordal graph G correspond to the proper colorings of triangulations of G. As a consequence, we obtain polynomial-time algorithms for the acyclic coloring problem and the perfect phylogeny problem on the class of weakly chordal graphs. Our results also imply li...
متن کاملThe application of chordal graphs to inferring phylogenetic trees of languages
Phylogenetic methods are used to build evolutionary trees of languages given character data that may include lexical, phonological, and morphological information. Such data rarely admits a perfect phylogeny. We explore the use of the more permissive conservative Dollo phylogeny as an alternative or complementary approach. We propose a heuristic search algorithm based on the notion of chordal gr...
متن کاملStrictly chordal graphs are leaf powers
A fundamental problem in computational biology is the phylogeny reconstruction for a set of specific organisms. One of the graph theoretical approaches is to construct a similarity graph on the set of organisms where adjacency indicates evolutionary closeness, and then to reconstruct a phylogeny by computing a tree interconnecting the organisms such that leaves in the tree are labeled by the or...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملUnique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs
The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters. Such a tree exists precisely when an intersection graph associated with the character set, called the partition intersection graph, can be triangulated using a restricted set of fill edges. Semple and Steel used the partition i...
متن کامل